Correction: Bruni, M.E.; Khodaparasti, S. A Variable Neighborhood Descent Matheuristic for the Drone Routing Problem with Beehives Sharing. Sustainability 2022, 14, 9978
نویسندگان
چکیده
There was an error in the original publication [...]
منابع مشابه
A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
The vehicle routing problem with cross-docking (VRPCD) consists in defining a set of routes that satisfy transportation requests between a set of pickup points and a set of delivery points. The vehicles bring goods from pickup locations to a cross-docking platform, where the items may be consolidated for efficient delivery. In this paper we propose a new solution methodology for this problem. I...
متن کاملProfitable Vehicle Routing Problem with Multiple Trips: Modeling and Variable Neighborhood Descent Algorithm
In this paper, we tackle a new variant of the Vehicle Routing Problem (VRP) which combines two known variants namely the Profitable VRP and the VRP with Mult iple Trips. The resulting problem may be called the Profitable Vehicle Routing Problem with Multiple Trips. The main purpose is to cover and solve a more complex realistic situation of the distribution transportation. The profitability con...
متن کاملA variable neighborhood search based matheuristic for nurse rostering problems
A practical nurse rostering problem, which arises at a ward of an Italian private hospital, is considered. In this problem, it is required each month to generate the nursing staff shifts subject to various requirements. A matheuristic approach is introduced, based on a set of neighborhoods searched by a commercial integer programming solver within a defined global time limit. Generally speaking...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملA Variable Neighborhood Descent for Arc Routing Problems with Time-Dependent Service Costs
This paper proposes a variable neighborhood descent for solving a capacitated arc routing problem with time-dependent service costs. The problem is motivated by winter gritting applications where the timing of each intervention is crucial. The variable neighborhood descent is based on neighborhood structures that manipulate arcs or sequences of arcs. Computational results are reported on proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainability
سال: 2022
ISSN: ['2071-1050']
DOI: https://doi.org/10.3390/su142315623